New linear codes over GF(8)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New linear codes over 𝔽9

Let dg (n, k) be the maximum possible minimum Hamming distance of a linear [n, k] code over lFg• In this paper, twenty-four new linear codes over lFg are constructed which improve the table of dg(n, k) by Brouwer. Four of these codes meet the upper bound on dg (n, k) and so are optimal. A geometric interpretation of the small dimensional codes is also given.

متن کامل

New linear codes over GF(8)1

Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...

متن کامل

New Linear Codes over Zps via the Trace Map

The trace map has been used very successfully to generate cocyclic complex and Butson Hadamard matrices and simplex codes over Z4 and Z2s . We extend this technique to obtain new linear codes over Zps . It is worth nothing here that these codes are cocyclic but not simplex codes. Further we find that the construction method also gives Butson Hadamard matrices of order p.

متن کامل

New minimum distance bounds for linear codes over GF(5)

Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Linear Codes over Finite Rings

Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2000

ISSN: 0893-9659

DOI: 10.1016/s0893-9659(99)00159-7